Compressing Propositional Refutations
نویسنده
چکیده
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large propositional refutations, such as those produced by SAT-solvers.
منابع مشابه
Compressing Propositional Refutations Using Subsumption
We describe ongoing work on the use of subsumption to remove redundant inferences from propositional resolution refutation proofs of the style generated by conflict driven clause learning SAT solvers. This is used for faster LCF-style proof replay in interactive theorem provers. There may also be an application in the extraction of small unsatisfiable cores.
متن کاملProof Complexity of Relativized Statements
The first-order formulas that do not have finite models give rise to uniform families of propositional unsatisfiable formulas, one for each finite cardinality. Motivated by the question of characterizing the class of such formulas whose propositional translations have short resolution refutations, we study their closure properties. Our starting point is the observation that the class of relativ...
متن کاملGood Degree Bounds on Nullstellensatz Refutations of the Induction Principle
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction principle.
متن کاملAverage-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas
Separating different propositional proof systems—that is, demonstrating that one proof system cannot efficiently simulate another proof system—is one of the main goals of proof complexity. Nevertheless, all known separation results between non-abstract proof systems are for specific families of hard tautologies: for what we know, in the average case all (non-abstract) propositional proof system...
متن کاملOn Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation
We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek [FKO06], as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and Ω(n) clauses. Such small size ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 185 شماره
صفحات -
تاریخ انتشار 2007